Date: Tue, 10 Dec 1996 21:22:25 GMT
Server: NCSA/1.4.2
Content-type: text/html
Last-modified: Sun, 17 Nov 1996 06:15:06 GMT
Content-length: 6657

<HTML>
<HEAD>
<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=ISO-8859-1">

<META NAME="GENERATOR" CONTENT="Internet Assistant for Microsoft Word 2.04z">
<TITLE>Untitled</TITLE>
</HEAD>
<BODY>
<P>
<CENTER><B><FONT SIZE=4 FACE="Palatino">Curriculum Vitae<BR>
</FONT></B></CENTER>
<P>
<CENTER><FONT FACE="Palatino">Brendan Marshall Mumey<BR>
<BR>
</FONT></CENTER>
<P>
<FONT SIZE=2 FACE="Palatino">I am currently a Ph.D. candidate
in the Department of Computer Science at the University of Washington.
  I entered in the fall of 1992 and expect to graduate by the
fall of 1996. I am 28 years old.  I have dual US and Canadian
citizenship.<BR>
</FONT>
<P>
<B><FONT FACE="Palatino">Contact Information<BR>
</FONT></B>
<P>
<FONT SIZE=2 FACE="Palatino">Department of Computer Science</FONT>
<P>
<FONT SIZE=2 FACE="Palatino">University of Washington</FONT>
<P>
<FONT SIZE=2 FACE="Palatino">Seattle, WA, 98195-2350 <BR>
</FONT>
<P>
<FONT SIZE=2 FACE="Palatino">Voice: (206) 685-4087 (day) or (206)
322-2099 (evening)</FONT>
<P>
<FONT SIZE=2 FACE="Palatino">Fax:  (206) 543-2969</FONT>
<P>
<FONT SIZE=2 FACE="Palatino">E-mail: brendan@cs.washington.edu</FONT>
<P>
<FONT SIZE=2 FACE="Palatino">WWW: http://www.cs.washington.edu/homes/brendan/
<BR>
</FONT>
<P>
<B><FONT FACE="Palatino">Research<BR>
</FONT></B>
<P>
<FONT SIZE=2 FACE="Palatino">My general interests run to applying
theoretical techniques to solve problems which have practical
motivation. My current work is in computational biology.  Specifically,
I have worked on the problem of comparing DNA clones based on
their &quot;multiple complete digest&quot; fingerprint. This fingerprint
is gathered by digesting each clone with several different restriction
enzymes and measuring (using gel electrophoresis) the lengths
into which each clone is divided. Using a stochastic model of
this process, I developed an estimator of the a posteriori probability
that two clones overlap given their measured fingerprints. An
overlap test based on this approach is provably powerful in the
sense of achieving nearly the lowest rate of false negatives for
a given rate of false positives. Using this overlap test, I have
implemented a clone ordering algorithm which is crucial to finishing
the map.<BR>
</FONT>
<P>
<FONT SIZE=2 FACE="Palatino">More recently, I have been working
on a clustering problem which arises in the context of classifying
prostate cancer cells. The raw data consists of quantized hybridization
levels for several hundred cell lines against perhaps 25,000 cDNA
oligos. The problem is to discover the important features which
determine the general type and lethality of a particular cell
line.  This is joint with work with Dick Karp and Leroy Hood's
lab in the molecular biotechnology department at the University
of Washington.<BR>
</FONT>
<P>
<FONT SIZE=2 FACE="Palatino">I have also done some work in computational
astrophysics; my contribution being a new parallel algorithm and
implementation for detecting clusters in points sets. With Maria
Klawe I developed new upper and lower bounds for computing the
optimal alphabetic tree data structure.<BR>
<BR>
<BR>
</FONT>
<P>
<B><FONT FACE="Palatino">Education<BR>
</FONT></B>
<P>
<FONT SIZE=2 FACE="Palatino">Ph.D. (expected fall 1996), Computer
Science, University of Washington. Advisor: Dr. Larry Ruzzo.<BR>
</FONT>
<P>
<FONT SIZE=2 FACE="Palatino">M.Sc., Computer Science, University
of British Columbia, August, 1992. Advisor: Dr. Maria Klawe. Thesis
title: Some New Results on Constructing Optimal Alphabetic Binary
Trees.<BR>
</FONT>
<P>
<FONT SIZE=2 FACE="Palatino">B.Sc. (Honors First Class), Mathematics,
University of Alberta, May, 1990.<BR>
</FONT>
<P>
<B><FONT FACE="Palatino">Academic Experience<BR>
</FONT></B>
<P>
<FONT SIZE=2 FACE="Palatino">University of Washington. Pre-doctoral
fellowship in genomic sciences. Awarded September, 1995.<BR>
</FONT>
<P>
<FONT SIZE=2 FACE="Palatino">University of Washington. Teaching
assistant for CSE321, an introductory discrete mathematics course.
September-December, 1994. Received very good to excellent evaluations.
<BR>
</FONT>
<P>
<FONT SIZE=2 FACE="Palatino">University of Washington. Research
assistant. September, 1992 until present.<BR>
</FONT>
<P>
<FONT SIZE=2 FACE="Palatino">UCSD Supercomputer Center. Participant
in the 1993 Metacenter Computational Science Institute in Parallel
Computing. August, 1993.<BR>
</FONT>
<P>
<FONT SIZE=2 FACE="Palatino">University of British Columbia. NSERC
Postgraduate fellow. September, 1990 to August, 1992.<BR>
</FONT>
<P>
<B><FONT FACE="Palatino">Other Achievements<BR>
</FONT></B>
<P>
<FONT SIZE=2 FACE="Palatino">Several undergraduate prizes in Mathematics.
Placed in the top 3% in 1990 Putnam undergraduate mathematics
competition. Accepted to the doctoral program in computer science
at MIT.<BR>
</FONT>
<P>
<B><FONT FACE="Palatino">Publications<BR>
</FONT></B>
<P>
<FONT SIZE=2 FACE="Palatino">B. Mumey, A powerful clone overlap
test. Submitted to the ISMB'96 conference.<BR>
</FONT>
<P>
<FONT SIZE=2 FACE="Palatino">M. Klawe and B. Mumey, Upper and
Lower Bounds on Constructing</FONT>
<P>
<FONT SIZE=2 FACE="Palatino">Optimal Alphabetic Trees. Proceedings
of the 1993 ACM/SIAM Symposium on</FONT>
<P>
<FONT SIZE=2 FACE="Palatino">Discrete Algorithms. January, 1993.
The SIAM Journal on Discrete Math. November, 1995.<BR>
</FONT>
<P>
<FONT SIZE=2 FACE="Palatino">B. Mumey, Fast Cluster Detection
in Point Sets. Presented at the 1994 DIMACS Challenge.<BR>
</FONT>
<P>
<FONT SIZE=2 FACE="Palatino">My papers are available on-line at:
http://www.cs.washington.edu/homes/brendan/<BR>
</FONT>
<P>
<B><FONT FACE="Palatino">References<BR>
</FONT></B>
<P>
<FONT SIZE=2 FACE="Palatino">Dr. Larry Ruzzo </FONT>
<P>
<FONT SIZE=2 FACE="Palatino"> Department of Computer Science</FONT>
<P>
<FONT SIZE=2 FACE="Palatino"> University of Washington</FONT>
<P>
<FONT SIZE=2 FACE="Palatino"> (206) 543-6298  </FONT>
<P>
<FONT SIZE=2 FACE="Palatino"> ruzzo@cs.washington.edu<BR>
</FONT>
<P>
<FONT SIZE=2 FACE="Palatino">Dr. Richard Karp </FONT>
<P>
<FONT SIZE=2 FACE="Palatino"> Department of Computer Science</FONT>
<P>
<FONT SIZE=2 FACE="Palatino"> University of Washington</FONT>
<P>
<FONT SIZE=2 FACE="Palatino"> (206) 543-1695</FONT>
<P>
<FONT SIZE=2 FACE="Palatino"> karp@cs.washington.edu<BR>
</FONT>
<P>
<FONT SIZE=2 FACE="Palatino">Dr. Maria Klawe </FONT>
<P>
<FONT SIZE=2 FACE="Palatino"> Department of Computer Science</FONT>
<P>
<FONT SIZE=2 FACE="Palatino"> University of British Columbia</FONT>
<P>
<FONT SIZE=2 FACE="Palatino"> (604) 822-3064</FONT>
<P>
<FONT SIZE=2 FACE="Palatino"> klawe@cs.ubc.ca<BR>
</FONT>
</BODY>
</HTML>
